On multiple priority multi-server queues with impatience

نویسندگان

  • Oualid Jouini
  • A. Roubos
چکیده

We consider Markovian multi-server queues with two types of impatient customers: highand low-priority ones. The first type of customers has a non-preemptive priority over the other type. After entering the queue, a customer will wait a random length of time for service to begin. If service has not begun by this time he or she will abandon and be lost. We consider two cases where the discipline of service within each customer type is FCFS or LCFS. For each type of customers, we focus on various performance measures related to queueing delays: unconditional waiting times, and conditional waiting times given service and given abandonment. The analysis we develop holds also for a priority queue with mixed policies, i.e., FCFS for the first type and LCFS for the second one, and vice versa. We explicitly derive the Laplace-Stieltjes transforms of the defined random variables. In addition we show how to extend the analysis to more than two customer types. Finally we compare FCFS and LCFS and gain insights through numerical experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of customers' impatience in queues with server vacations

Many models for customers impatience in queueing systems have been studied in the past; the source of impatience has always been taken to be either a long wait already experienced at a queue, or a long wait anticipated by a customer upon arrival. In this paper we consider systems with servers vacations where customers’ impatience is due to an absentee of servers upon arrival. Such a model, repr...

متن کامل

On completion times in a two-class priority queue with impatience

In this note, we consider a two-class priority queueing system with Poisson arrivals, general service time distribution and one server, in which customers that are not currently being served may leave the queue according to exponentially distributed patience times, i.e., a M1, M2/G/1 + M system using a generalised Kendall’s notation. We expand the classic methodology to derive analytical formul...

متن کامل

On Two Priority Multi-Server Queues with Impatient Customers

 This study considers a system of multi-server queues with two classes of impatient customers: high-priority and low-priority. Customers join the system according to a Poisson process and customers may abandon service after entering the queue for an exponentially distributed duration with distinct rates. In this paper, we consider last come-first served (LCFS) and first come-first served (FCFS...

متن کامل

A Multiple Dispatch Queueing Model of Police Patrol Operations*

One of the primary concerns of urban police departments is the effective use of patrol cars. In large cities, police assigned to patrol cars typically account for more than 50% of total police manpower and their allocation has become particularly crucial in light of recent fiscal cutbacks. The police patrol system is a complex multi-server queueing system, and recently many urban police departm...

متن کامل

Multi-class, multi-server queues with non-preemptive priorities

In this paper we consider a multi-class, multi-server queueing system with non-preemptive priorities. We distinguish two groups of priority classes that consist of multiple items, each having their own arrival and service rate. We assume Poisson arrival processes and exponentially distributed service times. We derive an approximation method to estimate the steady state probabilities with an app...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JORS

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2014